首页> 外文OA文献 >Cost Minimizing Online Algorithms for Energy Storage Management with Worst-case Guarantee
【2h】

Cost Minimizing Online Algorithms for Energy Storage Management with Worst-case Guarantee

机译:成本最小化能量存储管理的在线算法   最坏情况保证

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The fluctuations of electricity prices in demand response schemes andintermittency of renewable energy supplies necessitate the adoption of energystorage in microgrids. However, it is challenging to design effective real-timeenergy storage management strategies that can deliver assured optimality,without being hampered by the uncertainty of volatile electricity prices andrenewable energy supplies. This paper presents a simple effective onlinealgorithm for the charging and discharging decisions of energy storage thatminimizes the electricity cost in the presence of electricity pricefluctuations and renewable energy supplies, without relying on the futureinformation of prices, demands or renewable energy supplies. The proposedalgorithm is supported by a near-best worst-case guarantee (i.e., competitiveratio), as compared to the offline optimal decisions based on full futureinformation. Furthermore, the algorithm can be adapted to take advantage oflimited future information, if available. By simulations on real-world data, itis observed that the proposed algorithms can achieve satisfactory outcome inpractice.
机译:需求响应计划中的电价波动和可再生能源供应的间歇性,使得微电网必须采用能量存储。但是,设计有效的实时储能管理策略具有挑战性,这可以确保在不因电价波动和可再生能源供应的不确定性而受到阻碍的情况下实现最优性。本文提出了一种用于储能充电和放电决策的简单有效的在线算法,该算法在存在电价波动和可再生能源供应的情况下将电费降至最低,而无需依赖于未来的价格,需求或可再生能源供应信息。与基于完整的未来信息的离线最优决策相比,该提议的算法得到了近乎最佳的最坏情况保证(即竞争比)的支持。此外,该算法可以进行调整以利用有限的未来信息(如果可用)。通过对现实世界数据的仿真,艾蒂斯发现所提出的算法可以在实践中取得令人满意的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号